package algorithm.dp;

// 地下城游戏
public class LC174 {
    public int calculateMinimumHP(int[][] dungeon) {
        // 1. 创建 dp 表
        int m = dungeon.length, n = dungeon[0].length;
        int[][] dp = new int[m+1][n+1];

        // 2. 初始化
        for (int j = 0; j <= n; j++) dp[m][j] = Integer.MAX_VALUE;
        for (int i = 0; i <= m; i++) dp[i][n] = Integer.MAX_VALUE;
        dp[m-1][n] = 1; dp[m][n-1] = 1;

        // 3. 填表
        for (int i = m-1; i >= 0; i--) {
            for (int j = n-1; j >= 0; j--) {
                dp[i][j] = Math.min(dp[i][j+1], dp[i+1][j]) - dungeon[i][j];
                dp[i][j] = Math.max(1, dp[i][j]);
            }
        }
        return dp[0][0];
    }

    public static void main(String[] args) {
        LC174 lc174 = new LC174();
        int [][] d = {{0,-3}};
        System.out.println(lc174.calculateMinimumHP(d));
    }
}
